On the linear complexity and lattice test of nonlinear pseudorandom number generators
نویسندگان
چکیده
One of the main contributions which Harald Niederreiter made to mathematics is related to pseudorandom sequences theory. In this paper we study several measures for asserting the quality of pseudorandom sequences, involving generalizations of linear complexity and lattice tests and relations between them.
منابع مشابه
Lattice Structure of Nonlinear Pseudorandom Number Generators in Parts of the Period
Recently, we showed that an extension of Marsaglia’s lattice test for segments of sequences over arbitrary fields and the linear complexity profile provide essentially equivalent quality measures for the intrinsic structure of pseudorandom number sequences. More precisely, the knowledge of the linear complexity profile yields a value S such that the largest dimension for passing the above latti...
متن کاملOn the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials
Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and MonteCarlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudor...
متن کاملOn lattice profile of the elliptic curve linear congruential generators
Lattice tests are quality measures for assessing the intrinsic structure of pseudorandom number generators. Recently a new lattice test has been introduced by Niederreiter and Winterhof. In this paper, we present a general inequality that is satisfied by any periodic sequence. Then, we analyze the behavior of the linear congruential generators on elliptic curves (abbr. EC-LCG) under this new la...
متن کاملOn the linear complexity profile of explicit nonlinear pseudorandom numbers
Bounds on the linear complexity profile of a general explicit nonlinear pseudorandom number generator are obtained. For some special explicit nonlinear generators including the explicit inversive generator these results are improved. 2002 Elsevier Science B.V. All rights reserved.
متن کاملOn the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
We obtain lower bounds on the linear and nonlinear complexity profile of a general nonlinear pseudorandom number generator, of the inversive generator, and of a new nonlinear generator called quadratic exponential generator. The results are interesting for applications to cryptography and Monte Carlo methods.
متن کامل